The Current State of Ant Colony Optimisation Applied to Dynamic Problems
نویسنده
چکیده
منابع مشابه
Discrete History Ant Systems
Ant Colony Optimisation (ACO) algorithms are inspired by the foraging behaviour of real ants and are a relatively new class of algorithm which have shown promise when applied to combinatorial optimisation problems. In recent years ACO algorithms have begun to gain popularity and as such are beginning to be applied to more complex problem domains including (but not limited to) dynamic problems. ...
متن کاملSolving Problems with Hidden Dynamics - Comparison of Extremal Optimisation and Ant Colony System
dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a dynamic problem that does not notify the solver when a change has been made is very difficult for most well-known algorithms. Extremal Optimisation is a recent addition to the group of biologically inspired optimisation algorithms, while Ant Colony System has been used to solve a large variety o...
متن کاملDynamic Optimisation of Chemical Engineering Processes Using the Bees Algorithm
An improved version of the Bees Algorithm is proposed for solving dynamic optimisation problems. This new formulation of the Bees Algorithm includes new search operators, and a new selection procedure that enhances the survival probability of newly formed individuals. The proposed algorithm is tested on six benchmark dynamic optimisation problems. The benchmark problems include minimisation and...
متن کاملApplying Ant Colony Optimisation (ACO) algorithm to dynamic job shop scheduling problems
Ant Colony Optimization (ACO) is applied to two dynamic job scheduling problems, which have the same mean total workload but different dynamic levels and disturbing severity. Its performances are statistically analysed and the effects of its adaptation mechanism and parameters such as the minimal number of iterations and the size of searching ants are studied. The results show that ACO can perf...
متن کاملAnt Colony Optimisation for vehicle routing problems: from theory to applications
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we show its successful application to the Vehicle Routing Problem (VRP). First, we introduce VRP and its many variants, such as VRP with Time Windows, Time Dependent VRP, Dynamic VRP, VRP with Pickup and Delivery. These variants have been formulated in order to bring the VRP as close as possible to...
متن کامل